Relaxations of the Cutting Plane Method for QuadraticSemi - In
نویسندگان
چکیده
This paper studies the cutting plane method for solving quadratic semi-innnite programming problems. Several relaxation techniques and their combinations are proposed and discussed. A exible convergence proof is provided to cover diierent settings. The implementation issues are addressed with some numerical experiments to illustrate the computational behavior of each diierent combination scheme.
منابع مشابه
Computational Experience with an Interior Point Cutting Plane Algorithm
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algorithms work by solving a sequence of linear programming relaxations of the integer programming problem, and they use the simplex algorithm to solve the relaxations. In this paper, we describe experiments using a predicto...
متن کاملA Cutting Plane Algorithm for Large Scale Semidefinite Relaxations
The recent spectral bundle method allows to compute, within reasonable time, approximate dual solutions of large scale semidefinite quadratic 0-1 programming relaxations. We show that it also generates a sequence of primal approximations that converge to a primal optimal solution. Separating with respect to these approximations gives rise to a cutting plane algorithm that converges to the optim...
متن کاملComparison of two integration schemes for a micropolar plasticity model
Micropolar plasticity provides the capability to carry out post-failure simulations of geo-structures due to microstructural considerations and embedded length scale in its formulation. An essential part of the numerical implementation of a micropolar plasticity model is the integration of the rate constitutive equations. Efficiency and robustness of the implementation hinge on the type of int...
متن کامل1 Solving Linear Ordering Problems with a Combined Interior Point / Simplex Cutting Plane Algorithm
We describe a cutting plane algorithm for solving linear ordering problems. The algorithm uses a primal-dual interior point method to solve the rst few relaxations and then switches to a simplex method to solve the last few relaxations. The simplex method uses CPLEX 4.0. We compare the algorithm with one that uses only an interior point method and with one that uses only a simplex method. We so...
متن کاملCutting Plane Methods and Subgradient Methods
Interior point methods have proven very successful at solving linear programming problems. When an explicit linear programming formulation is either not available or is too large to employ directly, a column generation approach can be used. Examples of column generation approaches include cutting plane methods for integer programming and decomposition methods for many classes of optimization pr...
متن کامل